/*
Copyright (C) 2009-2010 Xanadu Development Team

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; version 2
of the License.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
*/

#pragma once

#include <hash_map>
#include "DataStruct.h"

template <typename T, typename R = int>
class TopDataStruct {
protected:
	stdext::hash_map <R, T*> datah;
	vector <T*> datav;
public:
	TopDataStruct() {
	}
	void add(T* ds) {
		datah[ds->getID()] = ds;
		datav.push_back(ds);
	}
	T* getDataByID(R id) {
		if(datah.find(id) != datah.end())
			return datah[id];
		return NULL;
	}
	int getCount() {
		return (int)datav.size();
	}
	vector <T*>* getData() {
		return &datav;
	}
};
